On Partial Linearization of Byte Substitution Transformation of Rijndael-The AES
نویسنده
چکیده
Abstract: Rijndael-The AES is 128-bit block cipher based on an elegant algebraic structure over F2. This cipher employs a simple approach to its substitution, permutation (SP) operations. We take a close look at its internals; the byte substitution transformation function is the only non-linear function in Rijndael The AES. This transformation comprises of two steps operating on each byte. Here we are trying to remodel this to one step operation using indicator vector matrix representation. This representation is further extended to mathematically represent one complete encryption or decryption round of Rijndael the using indicator vector matrix representation that can be explored for better cryptoanalysis of the cipher.
منابع مشابه
A 2.29 Gbits/sec, 56 mW Non-Pipelined Rijndael AES Encryption IC in a 1.8V, 0.18 μm CMOS Technology
In October 2000 the National Institute of Standard and Technology (NIST) chose the Rijndael algorithm as the new Advanced Encryption Standard (AES). In this paper we present an ASIC implementation of the Rijndael core. The core includes a non-pipelined encryption datapath with an on-the-fly key schedule data path. At a nominal 1.8V, the IC runs at 125 MHz resulting in a throughput of 2.29 Gbits...
متن کاملOn the Security of Rijndael-Like Structures against Differential and Linear Cryptanalysis
Rijndael-like structure is a special case of SPN structure. The linear transformation of Rijndael-like structures consists of linear transformations of two types, the one is byte permutation π and the other is linear transformation θ = (θ1, θ2, θ3, θ4), where each of θi separately operates on each of the four columns of a state. Furthermore, π and θ have some interesting properties. In this pap...
متن کاملVLSI Implementation Of High Performance Montgomery Modular Multiplication For Crypto graphical Application
-The multiplier receives and outputs the data with binary representation and uses only one-level Carry Save Adder (CSA) to avoid the carry propagation at each addition operation. This CSA is also used to perform operand pre computation and format conversion from the carry save format to the binary representation, leading to a low hardware cost and short critical path delay at the expense of ext...
متن کاملOptimization of AES Encryption Algorithm with S- Box
In any wireless communication, security is crucial during data transmission. The encryption and decryption of data is the major challenge faced in the wireless communication for security of the data. These algorithms are used to ensure the security in the transmission channels. Similarly hardware utilization and power consumption are another major things to be considered since most of the mobil...
متن کاملImproved "Partial Sums"-based Square Attack on AES
The Square attack as a means of attacking reduced round variants of AES was described in the initial description of the Rijndael block cipher. This attack can be applied to AES, with a relatively small number of chosen plaintext-ciphertext pairs, reduced to less than six rounds in the case of AES-128 and seven rounds otherwise and several extensions to this attack have been described in the lit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005